Catalan numbers as discrepancies for a family of substitutions on infinite alphabets
نویسندگان
چکیده
In this work, we consider a class of substitutions on infinite alphabets and show that they exhibit growth behaviour which is impossible for finite alphabets. While both settings the leading term tile counting function exponential (and guided by inflation factor), second-order strikingly different. For setting, it known second also or times polynomial. We large family examples where at least in n divided half-integer powers n, number substitution steps. particular, provide an identity discrepancy terms linear combinations Catalan numbers.
منابع مشابه
On a Class of P Automata as a Machine Model for Languages over Infinite Alphabets
We show how P automata having a finite description and working with a finite object-alphabet can be used to describe languages over countably infinite alphabets. We propose to relate the language classes characterized by different types of P automata to some of the existing characterizations of language classes over infinite alphabets, and give an upper bound for the class of languages accepted...
متن کاملAutomata over Infinite Alphabets
In many contexts such as validation of XML data, software model checking and parametrized verification, the systems studied are naturally abstracted as finite state automata, but whose input alphabet is infinite. While use of such automata for verification requires that the non-emptiness problem be decidable, ensuring this is non-trivial, since the space of configurations of such automata is in...
متن کاملCoincidences of Catalan and Q-catalan Numbers
Let Cn and Cn(q) be the nth Catalan number and the nth q-Catalan number, respectively. In this paper, we show that the Diophantine equation Cn = Cm(q) has only finitely many integer solutions (m,n, q) with m > 1, n > 1, q > 1. Moreover, they are all effectively computable. – To Professor Carl Pomerance on his 65th birthday
متن کاملCatalan numbers
Catalan numbers appear in many places throughout mathematics, and are a fairly frequent subject for articles in this magazine. Indeed, a very nice introduction to their properties was given in this magazine by Vun and Belcher [3], and a historical account of their discovery in Chinese mathematics (before Catalan!) has also appeared in a recent article by Larcombe [1]. The article by Vun and Bel...
متن کاملOn finite alphabets and infinite bases
Van Glabbeek (1990) presented the linear time – branching time spectrum of behavioral semantics. He studied these semantics in the setting of the basic process algebra BCCSP, and gave finite, sound and ground-complete, axiomatizations for most of these semantics. Groote (1990) proved for some of van Glabbeek’s axiomatizations that they are ω-complete, meaning that an equation can be derived if ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Indagationes Mathematicae
سال: 2023
ISSN: ['0019-3577', '1872-6100']
DOI: https://doi.org/10.1016/j.indag.2023.06.010